Every synaptic algebra has the monotone square root property

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Every Monotone 3-Graph Property is Testable

Let k ≥ 2 be a fixed integer and P be a property of k-uniform hypergraphs. In other words, P is a (typically infinite) family of k-uniform hypergraphs and we say a given hypergraph H satisfies P if H ∈ P . For a given constant η > 0 a k-uniform hypergraph H on n vertices is η-far from P if no hypergraph obtained from H by changing (adding or deleting) at most ηn edges in H satisfies P . More pr...

متن کامل

Every Monotone Graph Property Has a Sharp Threshold Ehud Friedgut and Gil Kalai

In their seminal work which initiated random graph theory Erd os and R enyi discovered that many graph properties have sharp thresholds as the number of vertices tends to in nity We prove a conjecture of Linial that every monotone graph property has a sharp threshold This follows from the following theorem Let Vn p f g denote the Hamming space endowed with the probability measure p de ned by p ...

متن کامل

Every Countable Group Has the Weak Rohlin Property

We present a simple proof of the fact that every countable group Γ is weak Rohlin, that is, there is in the Polish space AΓ of measure preserving Γ-actions an action T whose orbit in AΓ under conjugations is dense. In conjunction with earlier results this in turn yields a new characterization of non-Kazhdan groups as those groups which admit such an action T which is also ergodic.

متن کامل

A Model in Which Every Boolean Algebra Has Many Subalgebras

We show that it is consistent with ZFC (relative to large cardinals) that every infinite Boolean algebra B has an irredundant subsetA such that 2|A| = 2|B|. This implies in particular that B has 2|B| subalgebras. We also discuss some more general problems about subalgebras and free subsets of an algebra. The result on the number of subalgebras in a Boolean algebra solves a question of Monk from...

متن کامل

Every Low 2 Boolean Algebra Has a Recursive Copy

The degree of a structure si is the Turing degree of its open diagram £»(j/) , coded as a subset of a>. Implicit in the definition is a particular presentation of the structure; the degree is not an isomorphism invariant. We prove that if a Boolean algebra si has a copy of low 2 degree, then there is a recursive Boolean algebra 33 which is isomorphic to si . This builds on work of Downey and Jo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Positivity

سال: 2016

ISSN: 1385-1292,1572-9281

DOI: 10.1007/s11117-016-0443-z